Characterization of Laborde-Mulder graphs (extended odd graphs)
نویسنده
چکیده
The identification of diametrical vertices in the d-dimensional hypercube (d >/3) leads to a (0, 2)-graph of degree d on 2 d1 vertices and of diameter [. d/2 J namely the extended odd graph (or Laborde-Mulder graph) for odd values of d, and the half-cube for even values of d. In this paper we prove that the diameter of a (0, 2)-graph of degree d on 2 ~~ vertices is at least [. d/2 .~ and when d is odd the equality holds if and only if the graph is a Laborde-Mulder graph,
منابع مشابه
Skolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملFinite prime distance graphs and 2-odd graphs
A graph G is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs are prime distance graphs if and only if the Tw...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملCharacterization of grid graphs
Burosch, G. and J.-M. Laborde, Characterization of grid graphs, Discrete Mathematics 87 (1991) 85-88. In this paper we are mainly interested in the characterization of grid graphs i.e. products of paths. Introduction A graph is called an (n-dimensional) p,-p2. . -p,-grid if it is the product of n paths Pp,, P,,, . * * , P,.. Those graphs are of special interest because they can be used for prac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 150 شماره
صفحات -
تاریخ انتشار 1996